A Topological Lattice Refinement Descriptor for Subdivision Schemes

نویسندگان

  • François Destelle
  • Cédric Gérot
  • Annick Montanvert
چکیده

The topological step of a subdivision scheme can be described as a refinement on regular tiling lattices, or more generally as a local transformation descriptor. The former classifies all the regular lattice transformations which give rise to other regular lattices. These regular lattice descriptors are limited by the type of the control mesh faces, the subdivided mesh must be composed by faces of the same type. The latter category describes some local topological transformations as the insertion of vertices in each face, followed by the description of a connectivity; such a descriptor is called meta-scheme. But these meta-schemes cannot describe a large number of regular refinements. We propose a topological descriptor that generalizes meta-schemes. Our descriptor is locally defined by a triple of integers which describes the number of inserted vertices relatively to the components of each face: vertices, edges and the face center. It is combined with a flexible connectivity descriptor which enhances modeling capability. Our descriptor can build the schemes commonly used and it can describe a variety of others, including many regular rotative schemes. We ensure the conservation of the control mesh global topology. The subdivision operators described here can be concatenated, leading to more complex topological descriptions. In addition, we propose a general geometric smoothing step.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi 4-8 Subdivision Surfaces

This paper presents a new scheme for subdivision surfaces that is based on four-directional meshes. It combines geometry-sensitive refinement with convolution smoothing. The scheme has a simple, efficient implementation and generates well-shaped meshes which converge to smooth surfaces. keywords: subdivision schemes, four-directional meshes, quincunx lattice, refinenement, smoothing.

متن کامل

A unified subdivision approach for multi-dimensional non-manifold modeling

This paper presents a new unified subdivision scheme that is defined over a k-simplicial complex in n-D space with k ≤ 3. We first present a series of definitions to facilitate topological inquiries during the subdivision process. The scheme is derived from the double (k + 1)-directional box splines over k-simplicial domains. Thus, it guarantees a certain level of smoothness in the limit on a r...

متن کامل

Subdivision schemes for shape preserving approximations

We use subdivision schemes with general dilation to efficiently evaluate shape preserving approximations. To fulfill our goal the refinement rules of the schemes are obtained by the refinement masks associated to refinable ripplets, i.e. refinable functions whose integer translates form a variation diminishing basis.

متن کامل

Analysis of Non-stationary Interpolatory Subdivision Schemes Based on Exponential Polynomials

In this study, we are concerned with non-stationary interpolatory subdivision schemes with refinement rules which may vary from level to level. First, we derive a new class of interpolatory non-stationary subdivision schemes reproducing exponential polynomials. Next, we prove that non-stationary schemes based on the known butterfly-shaped stencils possess the same smoothness as the known Butter...

متن کامل

Subdivision by WAVES – Weighted AVEraging Schemes

The Catmull-Clark subdivision algorithm consists of an operator that can be decomposed into a refinement and a smoothing operator, where the refinement operator splits each face with m vertices into m quadrilateral subfaces and the smoothing operator replaces each internal vertex with an affine combination of its neighboring vertices and itself. In this paper, we generalize the Catmull-Clark sc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008